On Subgraph Sizes in Random Graphs
نویسندگان
چکیده
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t : G contains a vertex-induced subgraph with t edges}. G has a full RSS if ρ(G) = {0, 1, . . . ,m}. We establish the threshold for a random graph to have a full RSS and give tight bounds on the likely RSS of a dense random graph. ∗Current Address: School of Mathematics, Georgia Institute of Technology, Atlanta GA30332 †Supported by NSF grant CCR-8900112
منابع مشابه
Percolation with small clusters on random graphs
We consider the problem of finding an induced subgraph in a random dregular graph such that its components have bounded size as the size of the graph gets arbitrarily large. We show that for any threshold τ , the largest size density of such an induced subgraph with component sizes bounded by τ is at most 2(log d)/d for asymptotically large d. A matching lower bound is known for independent set...
متن کاملCharacterization of L1-norm statistic for anomaly detection in Erdős Rényi graphs
We describe a test statistic based on the Lnorm of the eigenvectors of a modularity matrix to detect the presence of an embedded Erdős Rényi (ER) subgraph inside a larger ER random graph. An embedded subgraph may model a hidden community in a large network such as a social network or a computer network. We make use of the properties of the asymptotic distribution of eigenvectors of random graph...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملFinding induced subgraphs in scale-free inhomogeneous random graphs
We study the induced subgraph isomorphism problem on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that determines for any connected graph H on k vertices if it exists as induced subgraph in a random graph with n vertices. By exploiting the scale-free graph structure, the algorithm runs in O(ne 4 ) time, and finds for constant k an instance of...
متن کاملRandom dense bipartite graphs and directed graphs with specified degrees
Let s and t be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence s in one part and t in the other; equivalently, binary matrices with row sums s and column sums t. In particular, we find precise formulae for the probabilities that a given bipartite graph is edge-disjoint from, a subgraph of, or an induc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 1 شماره
صفحات -
تاریخ انتشار 1992